Rigorous Semantics and Refinement for Business Processes (Abstract)

نویسنده

  • Klaus-Dieter Schewe
چکیده

For the modelling of business processes it is necessary to integrate models for control flow, messaging, event handling, interaction, data management, and exception handling. In principle, all common business process models such as BPMN [14], YAWL [13], ARIS [11] or S-BPM [6] follow such an approach. Though it is claimed that the models have already reached a high level of maturity, they still lack rigorous semantics as pointed out in [1, 5, 15]. Furthermore, quite a few aspects such as data management, interaction and exception handling have only been dealt with superficially as pointed out in [12]. The first concern regarding rigorous semantics has been discussed in detail by Börger in [2] for BPMN, which led to an intensive investigation of BPMN semantics on the grounds of Abstract State Machines (ASMs, [4]), in particular for OR-synchronisation [3]. The monograph by Kossak et al. defines a rigorous semantics for a large subset of BPMN leaving out some ill-defined concepts [8]. The second concern can be addressed by means of horizontal refinement. On grounds of ASMs necessary subtle distinctions and extensions to the control flow model such as counters, priorities, freezing, etc. can be easily integrated in a smooth way [12]. Conservative extensions covering messaging can be adopted from S-BPM [6], while events in BPMN have been handled in [7]. For the event model it is necessary and sufficient to specify what kind of events are to be observed, which can be captured on the grounds of monitored locations in ASMs, and which event conditions are to be integrated into the model. Extensions concerning actor modelling, i.e. the specification of responsibilities for the execution of activities (roles), as well as rules governing rights and obligations lead to the integration of deontic constraints [10], some of which can be exploited to simplify the control flow [9]. In this way subtle distinctions regarding decision-making responsibilities in BPM can be captured.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verification of Model Transformations: A Case Study with BPEL

Model transformations, like refinement or refactoring, have to respect the semantics of the models transformed. In the case of behavioural models this semantics can be specified by transformations, too, describing an abstract interpreter for the language. Both kinds of transformations, if given in a rule-based way, can formally be described as graph transformations. In this paper, we present ex...

متن کامل

BPMN Core Modeling Concepts: Inheritance-Based Execution Semantics

We define an abstract model for the dynamic semantics of the core process modeling concepts in the OMG standard for BPMN 2.0. The UML class diagrams associated therein with each flow element are extended with a rigorous behavior definition, which reflects the inheritance hierarchy structure by refinement steps. The correctness of the resulting precise algorithmic model for an execution semantic...

متن کامل

A Relative Timed Semantics for BPMN

We describe a relative-timed semantic model for Business Process Modelling Notation (BPMN). We define the semantics in the language of Communicating Sequential Processes (CSP). This model augments our untimed model by introducing the notion of relative time in the form of delays chosen non-deterministically from a range. We illustrate the application by an example. We also show some properties ...

متن کامل

On the Refinement and Simulation of Data Types and Processes

This paper presents a behavioural semantics for abstract data types, and thus a correspondence between data types and processes. The value of this correspondence lies in the fact that simulation of the abstract data types is easily verified, and is equivalent to failures refinement of the corresponding processes. The method of constructing a semantics, and the method of proving equivalence betw...

متن کامل

True Concurrency can be Traced

In this paper sets of labelled partial orders are employed as fundamental mathematical entities for modelling nondeterministic and concurrent processes thereby obtaining so-called noninterleaving semantics. Based on closures of sets of labelled partial orders, a simple recursive algebraic language with refinement is given denotational models fully abstract w.r.t. corresponding behaviourally mot...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015